Multi-Agent Model based on Tabu Search for the Permutation Flow Shop Scheduling Problem
نویسندگان
چکیده
منابع مشابه
Multi-agent Model Based on Tabu Search for the Permutation Flow Shop Scheduling Problem
In this work, we suggest a Multi-Agent model based on a tabu search method for solving the permutation flow shop scheduling problem. The problem is strongly NP-hard and its resolution optimally within a reasonable time is impossible. The objective of this work is to minimize the makespan or the total duration of the schedule. The proposed model is composed of two classes of agents: Supervisor a...
متن کاملMulti-Agent Approach Based on Tabu Search for the Flexible Job Shop Scheduling Problem
This paper proposes a Multi-agent approach based on a tabu search method for solving the flexible Job Shop scheduling problem. The characteristic of the latter problem is that one or several machines can process one operation so that its processing time depends on the machine used. Such a generalization of the classical problem makes it more and more difficult to solve. The objective is to mini...
متن کاملHybrid tabu search for re-entrant permutation flow-shop scheduling problem
The assumption of classical shop scheduling problems that each job visits each machine only once (Baker, 1974) is often violated in practice. A new type of manufacturing shop, the reentrant shop has recently attracted attention. The basic characteristic of a re-entrant shop is that a job visits certain machines more than once. For example, in semiconductor manufacturing, consequently, each wafe...
متن کاملFlow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کاملGenetic Algorithm with Selective Local Search for Multi-objective Permutation Flow Shop Scheduling Problem
In this paper the flow shop scheduling problem with minimizing two criteria simultaneously is consider. Selected criteria are: makespan and the sum of tardiness of jobs. For each separate criteria the problem is strongly NP-hard, which makes it NP-hard as well. There is a number of heuristic algorithms to solve the flow shop problem with various single objectives, but heuristics for multi-crite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal
سال: 2014
ISSN: 2255-2863
DOI: 10.14201/adcaij2014382737